Reducing Lambda Terms with Traversals

Reducing Lambda Terms with Traversals (preprint) February 26, 2018

We introduce a method to evaluate untyped lambda terms by combining the theory of traversals,a term-tree traversing techniques inspired from Game Semantics [12, 8], with judicious use of theeta-conversion rule of the lambda calculus.The traversal theory of the simply-typed lambda calculus relies on the eta-long transform toensure that when traversing an application, there is...

Enumerators of lambda Terms are Reducing Constructively

Language Independent Traversals for Program Transformation

A Stratego program defines a transformation on first-order ground terms. Transformation rules define single transformation steps. Transformation rules are combined into transformation strategies by means of combinators that determine where and in what order rules are applied. These combinators include: primitives for traversal to the direct subterms of a node, allowing the definition of many ki...

An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals

It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...

Böhm trees, Krivine machine and the Taylor expansion of ordinary lambda-terms

We show that, given an ordinary lambda-term and a normal resource lambda-term which appears in the normal form of its Taylor expansion, the unique resource term of the Taylor expansion of the ordinary lambda-term reducing to this normal resource term can be obtained by running a version of the Krivine abstract machine.